Combining Random Sampling and Backward-Forward heuristics for Resource-Constrained Multi-Project Scheduling
نویسندگان
چکیده
In practice, organizations work in general on more than one project which share some or all the available resources. In this work hybrid heuristics that combine Random Sampling heuristics and Backward-Forward methods are developed for the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP). This heuristic approach has been successfully applied to resource-constrained single project scheduling when the objective to optimize is makespan. In this work, the mean project delay and the multi-project duration increase criteria are considered. The heuristics proposed includes several parameters which effect is analyzed through a wide computational study. The best configuration of these parameters is reported when considering both criteria.
منابع مشابه
An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کاملDetecting communities of workforces for the multi-skill resource-constrained project scheduling problem: A dandelion solution approach
This paper proposes a new mixed-integer model for the multi-skill resource-constrained project scheduling problem (MSRCPSP). The interactions between workers are represented as undirected networks. Therefore, for each required skill, an undirected network is formed which shows the relations of human resources. In this paper, community detection in networks is used to find the most compatible wo...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کاملConstrained Renewable Resource Allocation in Fuzzy Metagraphs via Min-Slack
This paper discusses that the fuzzy metagraphs can be used as a tool for scheduling and control of fuzzy projects. Often, available resources for executing projects may be limited. It is assumed the resources required to accomplish each activity of project (metagraph edges) is renewable. One of the common methods for scheduling projects is using the min-slack. So, first, the forward and bac...
متن کاملA biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem
This paper presents a biased random-keys genetic algorithm for the Resource Constrained Project Scheduling Problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are de ned by the genetic algorithm. A forward-backward improvement procedure is applied to all solution...
متن کامل